Midwest cousins of Barnes-Wall lattices

نویسنده

  • Robert L. Griess
چکیده

Given a rational lattice and suitable set of linear transformations, we construct a cousin lattice. Sufficient conditions are given for integrality, evenness and unimodularity. When the input is a Barnes-Wall lattice, we get multi-parameter series of cousins. There is a subseries consisting of unimodular lattices which have ranks 2d−1 ± 2d−k−1, for odd integers d ≥ 3 and integers k = 1, 2, · · · , d−1 2 . Their minimum norms are moderately high: 2b d 2 c−1.

منابع مشابه

Certain Lattice Neighboring from Barnes-wall Lattice and Some Laminated Lattices

We give classifications of integral lattices which include the Barnes-Wall lattice BW16 or laminated lattices of dimension 1 6 d 6 8 and of minimum 4. Also, we give certain lattice neighboring from each lattice. Furthermore, we study spherical designs and the other properties.

متن کامل

Certain Lattice Neighboring from Barnes-wall Lattice and Laminated Lattices

We give classifications of integral lattices which include the Barnes-Wall lattice BW16 or laminated lattices of dimension 1 6 d 6 8 and of minimum 4. Also, we give certain lattice neighboring from each lattice. Furthermore, we study spherical designs and the other properties.

متن کامل

A Simple Construction for the Barnes-Wall Lattices

A certain family of orthogonal groups (called “Clifford groups” by G. E. Wall) has arisen in a variety of different contexts in recent years. These groups have a simple definition as the automorphism groups of certain generalized Barnes-Wall lattices. This leads to an especially simple construction for the usual Barnes-Wall lattices. {This is based on the third author’s talk at the Forney-Fest,...

متن کامل

Pieces of 2 d : Existence and uniqueness for

We give a new existence proof for the rank 2d even lattices usually called the Barnes-Wall lattices, and establish new results on uniqueness, structure and transitivity of the automorphism group on certain kinds of sublattices. Our proofs are relatively free of calculations, matrix work and counting, due to the uniqueness viewpoint. We deduce the labeling of coordinates on which earlier constru...

متن کامل

Practical Decoders for Barnes-wall Lattice Constellations∗

EXTENDED ABSTRACT. In 2008, Micciancio and Nicolosi [1] have proposed a low-complexity algorithm to decode the infinite Barnes-Wall lattice BW2m ⊂ C2m for any m ≥ 1 such that the worst-case complexity is O ( N log(N) ) where N = 2. More recently, Construction A′ [2] of Barnes-Wall lattices has been proposed wherein the BW2m can be obtained as BW2m = (1+ i) mZ[i]2m ⊕L2m such that L2m is a cubic-...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

متن کامل
عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000